Equilibrium customers’ choice between FCFS and random servers

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equilibrium customers' choice between FCFS and random servers

Consider two servers of equal service capacity, one serving in a first-come first-served order (FCFS), and the other serving its queue in random order. Customers arrive as a Poisson process and each arriving customer observes the length of the two queues and then chooses to join the queue that minimizes its expected queueing time. Assuming exponentially distributed service times, we numerically...

متن کامل

Fcfs Infinite Bipartite Matching of Servers and Customers

We consider an infinite sequence of customers of types C = {1, 2, . . . , I } and an infinite sequence of servers of types S = {1, 2, . . . , J }, where a server of type j can serve a subset of customer types C(j) and where a customer of type i can be served by a subset of server types S(i). We assume that the types of customers and servers in the infinite sequences are random, independent, and...

متن کامل

On Customers Acting as Servers

We consider systems comprised of two interlacing M/M/ • /• type queues, where customers of each queue are the servers of the other queue. Such systems can be found for example in file sharing programs, SETI@home project, and other applications (see e.g. Arazi, Ben-Jacob and Yechiali (2005)). Denoting by Li the number of customers in queue i (Qi), i = 1, 2, we assume that Q1 is a multi-server fi...

متن کامل

Queues with slow servers and impatient customers

Article history: Received 6 August 2008 Accepted 18 February 2009 Available online 27 February 2009

متن کامل

Queues with Many Servers and Impatient Customers

The asymptotic many-server queue with abandonments, G/GI/N +GI , is considered in the qualityand efficiency-driven (QED) regime. Here the number of servers and the offered load are related via the square-root rule, as the number of servers increases indefinitely. QED performance entails short waiting times and scarce abandonments (high quality) jointly with high servers’ utilization (high effic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Queueing Systems

سال: 2009

ISSN: 0257-0130,1572-9443

DOI: 10.1007/s11134-009-9127-8